Some Fixed-Sample Ranking and Selection Problems
نویسندگان
چکیده
منابع مشابه
Some problems with sample size
When I began my career in medical statistics, back in 1972, little was heard of power calculations. In major journals, sample size often appeared to be whatever came to hand. For example, in that month, September 1972, the Lancet contained 31 research reports which used individual subject data, excluding case reports and animal studies. The median sample size was 33 (quartiles 12 and 85). In th...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
Flexible sample selection strategies for transfer learning in ranking
Ranking is a central component in information retrieval systems; as such, many machine learning methods for building rankers have been developed in recent years. An open problem is transfer learning, i.e. how labeled training data from one domain/market can be used to build rankers for another. We propose a flexible transfer learning strategy based on sample selection. source domain training sa...
متن کاملLikelihood Ratio Procedures for Subset Selection and Ranking Problems
This report deals with procedures for random-size subset selection from k(> 2) given populations where the distribution of ir^(i = l, ..., k) has a density f^(x;0^). Let ••• -®[k] denote unknown values of the parameters, and let ^[i]» ***'ïï[k] denote the corresponding populations. First, we have considered the problem of selection for consider the /s procedure that selects TT. if sup L(0;x) > ...
متن کاملSome fixed-parameter tractable classes of Dual and related problems⋆
In this paper we present fixed-parameter algorithms for the problem Dual—given two hypergraphs, decide if one is the transversal hypergraph of the other—and related problems. In the first part, we give algorithms for the parameters number of edges of the hypergraphs, the maximum degree of a vertex, and vertex complementary degrees. In the second part, we use an Apriori approach to obtain FPT re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1967
ISSN: 0003-4851
DOI: 10.1214/aoms/1177698778